0.00/0.03	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.06	% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.13/0.38	% Computer : n009.cluster.edu
0.13/0.38	% Model    : x86_64 x86_64
0.13/0.38	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.38	% Memory   : 8046.5625MB
0.13/0.38	% OS       : Linux 6.8.0-71-generic
0.13/0.38	% CPULimit : 1440
0.13/0.38	% WCLimit  : 180
0.13/0.38	% DateTime : Mon Jul 27 09:32:28 UTC 2026
0.13/0.39	% CPUTime  : 
0.13/0.39	Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.14/0.45	Running higher-order theorem proving
0.14/0.47	Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 180 /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.54	% (943215)Detected a higher-order problem, will run a greedy HOL sequence.
0.14/0.54	% (943226)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
0.14/0.54	% (943226)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
0.14/0.54	% (943226)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1883241230:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_1799 on theBenchmark for (1799ds/157Mi)
0.14/0.54	% (943221)lrs+10_16_si=on:nwc=1.5:random_seed=702480163:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_1799 on theBenchmark for (1799ds/18Mi)
0.14/0.54	% (943222)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=358868855:i=3:rtra=on:inj=on:ntd=on_1799 on theBenchmark for (1799ds/3Mi)
0.14/0.54	% (943220)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2618819741:s2a=on:i=87:rtra=on:ntd=on_1799 on theBenchmark for (1799ds/87Mi)
0.14/0.54	% (943223)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3957485045:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_1799 on theBenchmark for (1799ds/634Mi)
0.14/0.54	% (943224)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3304805393:i=24:av=off:rtra=on_1799 on theBenchmark for (1799ds/24Mi)
0.14/0.54	% (943222)Instruction limit reached! 
0.14/0.54	% (943222)------------------------------
0.14/0.54	% (943222)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
0.14/0.54	% (943222)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.14/0.54	% (943222)CaDiCaL version: 2.1.3
0.14/0.54	% (943222)Termination reason: Instruction limit
0.14/0.54	% (943222)Termination phase: Saturation
0.14/0.54	% (943222)Time elapsed: 0.004 s
0.14/0.54	% (943222)Peak memory usage: 12 MB
0.14/0.54	% (943222)Instructions burned: 3 (million)
0.14/0.54	% (943226) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-943215-943226"...
0.14/0.54	% (943226)...printing done.
0.14/0.54	% (943226)Refutation found. Thanks to Tanya!
0.14/0.54	% SZS status Theorem for theBenchmark
0.14/0.54	% SZS output start Proof for theBenchmark
0.14/0.54	thf(type_def_5, type, frac: $tType).
0.14/0.54	thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
0.14/0.54	thf(func_def_0, type, x: frac).
0.14/0.54	thf(func_def_1, type, y: frac).
0.14/0.54	thf(func_def_2, type, z: frac).
0.14/0.54	thf(func_def_3, type, u: frac).
0.14/0.54	thf(func_def_4, type, moref: (frac > frac > $o)).
0.14/0.54	thf(func_def_5, type, eq: (frac > frac > $o)).
0.14/0.54	thf(func_def_6, type, pf: (frac > frac > frac)).
0.14/0.54	thf(func_def_10, type, sF0: frac).
0.14/0.54	thf(func_def_11, type, sF1: frac).
0.14/0.54	thf(func_def_12, type, sF2: $o).
0.14/0.54	thf(f2,axiom,(
0.14/0.54	  (moref @ x @ y)),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',m)).
0.14/0.54	thf(f3,conjecture,(
0.14/0.54	  (moref @ (pf @ x @ z) @ (pf @ y @ u))),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65b)).
0.14/0.54	thf(f4,negated_conjecture,(
0.14/0.54	  ~(moref @ (pf @ x @ z) @ (pf @ y @ u))),
0.14/0.54	  inference(negated_conjecture,[status(cth)],[f3])).
0.14/0.54	thf(f5,axiom,(
0.14/0.54	  ~(moref @ z @ u) => (eq @ z @ u)),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',n)).
0.14/0.54	thf(f6,axiom,(
0.14/0.54	  ! [X3 : frac,X2 : frac,X0 : frac,X1 : frac] : ((moref @ X0 @ X1) => ((moref @ X2 @ X3) => (moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz64)).
0.14/0.54	thf(f7,axiom,(
0.14/0.54	  ! [X0 : frac,X3 : frac,X1 : frac,X2 : frac] : ((eq @ X0 @ X1) => ((eq @ X2 @ X3) => (eq @ (pf @ X0 @ X2) @ (pf @ X1 @ X3))))),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz56)).
0.14/0.54	thf(f8,axiom,(
0.14/0.54	  ! [X0 : frac] : (eq @ X0 @ X0)),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37)).
0.14/0.54	thf(f9,axiom,(
0.14/0.54	  ! [X1 : frac,X3 : frac,X2 : frac,X0 : frac] : ((moref @ X0 @ X1) => ((eq @ X0 @ X2) => ((eq @ X1 @ X3) => (moref @ X2 @ X3))))),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz44)).
0.14/0.54	thf(f10,axiom,(
0.14/0.54	  ! [X1 : frac,X0 : frac,X2 : frac] : ((moref @ X0 @ X1) => (moref @ (pf @ X0 @ X2) @ (pf @ X1 @ X2)))),
0.14/0.54	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz61)).
0.14/0.54	thf(f11,plain,(
0.14/0.54	  (moref @ x @ y)),
0.14/0.54	  inference(rectify,[],[f2])).
0.14/0.54	thf(f12,plain,(
0.14/0.54	  (((moref @ x @ y)) = $true)),
0.14/0.54	  inference(fool_elimination,[],[f11])).
0.14/0.54	thf(f13,plain,(
0.14/0.54	  ~(moref @ z @ u) => (eq @ z @ u)),
0.14/0.54	  inference(rectify,[],[f5])).
0.14/0.54	thf(f14,plain,(
0.14/0.54	  ~ (((moref @ z @ u)) = $true) => (((eq @ z @ u)) = $true)),
0.14/0.54	  inference(fool_elimination,[],[f13])).
0.14/0.54	thf(f15,plain,(
0.14/0.54	  ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((eq @ X0 @ X2) => ((eq @ X3 @ X1) => (eq @ (pf @ X0 @ X3) @ (pf @ X2 @ X1))))),
0.14/0.54	  inference(rectify,[],[f7])).
0.14/0.54	thf(f16,plain,(
0.14/0.54	  ! [X0 : frac,X3 : frac,X2 : frac,X1 : frac] : ((((eq @ X0 @ X2)) = $true) => ((((eq @ X3 @ X1)) = $true) => (((eq @ (pf @ X0 @ X3) @ (pf @ X2 @ X1))) = $true)))),
0.14/0.54	  inference(fool_elimination,[],[f15])).
0.14/0.54	thf(f17,plain,(
0.14/0.54	  ~(moref @ (pf @ x @ z) @ (pf @ y @ u))),
0.14/0.54	  inference(rectify,[],[f4])).
0.14/0.54	thf(f18,plain,(
0.14/0.54	  ~ (((moref @ (pf @ x @ z) @ (pf @ y @ u))) = $true)),
0.14/0.54	  inference(fool_elimination,[],[f17])).
0.14/0.54	thf(f21,plain,(
0.14/0.54	  ! [X0 : frac,X1 : frac,X2 : frac] : ((moref @ X1 @ X0) => (moref @ (pf @ X1 @ X2) @ (pf @ X0 @ X2)))),
0.14/0.54	  inference(rectify,[],[f10])).
0.14/0.54	thf(f22,plain,(
0.14/0.54	  ! [X1 : frac,X2 : frac,X0 : frac] : ((((moref @ X1 @ X0)) = $true) => (((moref @ (pf @ X1 @ X2) @ (pf @ X0 @ X2))) = $true))),
0.14/0.54	  inference(fool_elimination,[],[f21])).
0.14/0.54	thf(f23,plain,(
0.14/0.54	  ! [X0 : frac] : (eq @ X0 @ X0)),
0.14/0.54	  inference(rectify,[],[f8])).
0.14/0.54	thf(f24,plain,(
0.14/0.54	  ! [X0 : frac] : (((eq @ X0 @ X0)) = $true)),
0.14/0.54	  inference(fool_elimination,[],[f23])).
0.14/0.54	thf(f25,plain,(
0.14/0.54	  ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((moref @ X3 @ X0) => ((eq @ X3 @ X2) => ((eq @ X0 @ X1) => (moref @ X2 @ X1))))),
0.14/0.54	  inference(rectify,[],[f9])).
0.14/0.54	thf(f26,plain,(
0.14/0.54	  ! [X1 : frac,X2 : frac,X0 : frac,X3 : frac] : ((((moref @ X3 @ X0)) = $true) => ((((eq @ X3 @ X2)) = $true) => ((((eq @ X0 @ X1)) = $true) => (((moref @ X2 @ X1)) = $true))))),
0.14/0.54	  inference(fool_elimination,[],[f25])).
0.14/0.54	thf(f27,plain,(
0.14/0.54	  ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((moref @ X2 @ X3) => ((moref @ X1 @ X0) => (moref @ (pf @ X2 @ X1) @ (pf @ X3 @ X0))))),
0.14/0.54	  inference(rectify,[],[f6])).
0.14/0.54	thf(f28,plain,(
0.14/0.54	  ! [X2 : frac,X0 : frac,X1 : frac,X3 : frac] : ((((moref @ X2 @ X3)) = $true) => ((((moref @ X1 @ X0)) = $true) => (((moref @ (pf @ X2 @ X1) @ (pf @ X3 @ X0))) = $true)))),
0.14/0.54	  inference(fool_elimination,[],[f27])).
0.14/0.54	thf(f29,plain,(
0.14/0.54	  (((moref @ z @ u)) != $true) => (((eq @ z @ u)) = $true)),
0.14/0.54	  inference(flattening,[],[f14])).
0.14/0.54	thf(f30,plain,(
0.14/0.54	  (((moref @ (pf @ x @ z) @ (pf @ y @ u))) != $true)),
0.14/0.54	  inference(flattening,[],[f18])).
0.14/0.54	thf(f32,plain,(
0.14/0.54	  ! [X0 : frac,X3 : frac,X2 : frac,X1 : frac] : (((((eq @ (pf @ X0 @ X3) @ (pf @ X2 @ X1))) = $true) | (((eq @ X3 @ X1)) != $true)) | (((eq @ X0 @ X2)) != $true))),
0.14/0.54	  inference(ennf_transformation,[],[f16])).
0.14/0.54	thf(f33,plain,(
0.14/0.54	  ! [X1 : frac,X3 : frac,X2 : frac,X0 : frac] : ((((eq @ X0 @ X2)) != $true) | (((eq @ (pf @ X0 @ X3) @ (pf @ X2 @ X1))) = $true) | (((eq @ X3 @ X1)) != $true))),
0.14/0.54	  inference(flattening,[],[f32])).
0.14/0.54	thf(f35,plain,(
0.14/0.54	  ! [X1 : frac,X2 : frac,X0 : frac,X3 : frac] : ((((((moref @ X2 @ X1)) = $true) | (((eq @ X0 @ X1)) != $true)) | (((eq @ X3 @ X2)) != $true)) | (((moref @ X3 @ X0)) != $true))),
0.14/0.54	  inference(ennf_transformation,[],[f26])).
0.14/0.54	thf(f36,plain,(
0.14/0.54	  ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((eq @ X3 @ X2)) != $true) | (((moref @ X3 @ X0)) != $true) | (((moref @ X2 @ X1)) = $true) | (((eq @ X0 @ X1)) != $true))),
0.14/0.54	  inference(flattening,[],[f35])).
0.14/0.54	thf(f37,plain,(
0.14/0.54	  (((eq @ z @ u)) = $true) | (((moref @ z @ u)) = $true)),
0.14/0.54	  inference(ennf_transformation,[],[f29])).
0.14/0.54	thf(f38,plain,(
0.14/0.54	  ! [X0 : frac,X1 : frac,X2 : frac] : ((((moref @ X1 @ X0)) != $true) | (((moref @ (pf @ X1 @ X2) @ (pf @ X0 @ X2))) = $true))),
0.14/0.54	  inference(ennf_transformation,[],[f22])).
0.14/0.54	thf(f39,plain,(
0.14/0.54	  ! [X2 : frac,X0 : frac,X1 : frac,X3 : frac] : (((((moref @ (pf @ X2 @ X1) @ (pf @ X3 @ X0))) = $true) | (((moref @ X1 @ X0)) != $true)) | (((moref @ X2 @ X3)) != $true))),
0.14/0.54	  inference(ennf_transformation,[],[f28])).
0.14/0.54	thf(f40,plain,(
0.21/0.54	  ! [X3 : frac,X0 : frac,X1 : frac,X2 : frac] : ((((moref @ X1 @ X0)) != $true) | (((moref @ X2 @ X3)) != $true) | (((moref @ (pf @ X2 @ X1) @ (pf @ X3 @ X0))) = $true))),
0.21/0.54	  inference(flattening,[],[f39])).
0.21/0.54	thf(f41,plain,(
0.21/0.54	  ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((moref @ X2 @ X1)) != $true) | (((moref @ X3 @ X0)) != $true) | ($true = ((moref @ (pf @ X3 @ X2) @ (pf @ X0 @ X1)))))),
0.21/0.54	  inference(rectify,[],[f40])).
0.21/0.54	thf(f42,plain,(
0.21/0.54	  ! [X0 : frac,X1 : frac,X2 : frac,X3 : frac] : ((((eq @ X3 @ X2)) != $true) | (((eq @ (pf @ X3 @ X1) @ (pf @ X2 @ X0))) = $true) | (((eq @ X1 @ X0)) != $true))),
0.21/0.54	  inference(rectify,[],[f33])).
0.21/0.54	thf(f43,plain,(
0.21/0.54	  ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : ((((moref @ X2 @ X1)) = $true) | (((eq @ X3 @ X2)) != $true) | (((moref @ X3 @ X0)) != $true) | (((eq @ X0 @ X1)) != $true)) )),
0.21/0.54	  inference(cnf_transformation,[],[f36])).
0.21/0.54	thf(f44,plain,(
0.21/0.54	  ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : (($true = ((moref @ (pf @ X3 @ X2) @ (pf @ X0 @ X1)))) | (((moref @ X3 @ X0)) != $true) | (((moref @ X2 @ X1)) != $true)) )),
0.21/0.54	  inference(cnf_transformation,[],[f41])).
0.21/0.54	thf(f46,plain,(
0.21/0.54	  (((moref @ z @ u)) = $true) | (((eq @ z @ u)) = $true)),
0.21/0.54	  inference(cnf_transformation,[],[f37])).
0.21/0.54	thf(f47,plain,(
0.21/0.54	  ( ! [X0 : frac] : ((((eq @ X0 @ X0)) = $true)) )),
0.21/0.54	  inference(cnf_transformation,[],[f24])).
0.21/0.54	thf(f48,plain,(
0.21/0.54	  ( ! [X2 : frac,X0 : frac,X1 : frac] : ((((moref @ (pf @ X1 @ X2) @ (pf @ X0 @ X2))) = $true) | (((moref @ X1 @ X0)) != $true)) )),
0.21/0.54	  inference(cnf_transformation,[],[f38])).
0.21/0.54	thf(f49,plain,(
0.21/0.54	  (((moref @ (pf @ x @ z) @ (pf @ y @ u))) != $true)),
0.21/0.54	  inference(cnf_transformation,[],[f30])).
0.21/0.54	thf(f50,plain,(
0.21/0.54	  (((moref @ x @ y)) = $true)),
0.21/0.54	  inference(cnf_transformation,[],[f12])).
0.21/0.54	thf(f51,plain,(
0.21/0.54	  ( ! [X2 : frac,X3 : frac,X0 : frac,X1 : frac] : ((((eq @ (pf @ X3 @ X1) @ (pf @ X2 @ X0))) = $true) | (((eq @ X3 @ X2)) != $true) | (((eq @ X1 @ X0)) != $true)) )),
0.21/0.54	  inference(cnf_transformation,[],[f42])).
0.21/0.54	thf(f55,definition,(
0.21/0.54	  (sF0 = ((pf @ x @ z)))),
0.21/0.54	  introduced(definition,[new_symbols(definition,[sF0])],[function_definition])).
0.21/0.54	thf(f56,plain,(
0.21/0.54	  (((pf @ x @ z)) = sF0)),
0.21/0.54	  inference(reorient_equations,[],[f55])).
0.21/0.54	thf(f57,definition,(
0.21/0.54	  (sF1 = ((pf @ y @ u)))),
0.21/0.54	  introduced(definition,[new_symbols(definition,[sF1])],[function_definition])).
0.21/0.54	thf(f58,plain,(
0.21/0.54	  (((pf @ y @ u)) = sF1)),
0.21/0.54	  inference(reorient_equations,[],[f57])).
0.21/0.54	thf(f59,definition,(
0.21/0.54	  (sF2 = ((moref @ sF0 @ sF1)))),
0.21/0.54	  introduced(definition,[new_symbols(definition,[sF2])],[function_definition])).
0.21/0.54	thf(f60,plain,(
0.21/0.54	  (sF2 != $true)),
0.21/0.54	  inference(definition_folding,[],[f49,f59,f58,f56])).
0.21/0.54	thf(f61,plain,(
0.21/0.54	  (((moref @ sF0 @ sF1)) = $false) | (sF2 = $true)),
0.21/0.54	  inference(iff_proxy_clausification,[],[f59])).
0.21/0.54	thf(f64,definition,(
0.21/0.54	  spl3_1 <=> (((eq @ z @ u)) = $true)),
0.21/0.54	  introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition])).
0.21/0.54	thf(f66,plain,(
0.21/0.54	  (((eq @ z @ u)) = $true) | ~spl3_1),
0.21/0.54	  inference(avatar_component_clause,[],[f64])).
0.21/0.54	thf(f68,definition,(
0.21/0.54	  spl3_2 <=> (((moref @ z @ u)) = $true)),
0.21/0.54	  introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition])).
0.21/0.54	thf(f71,plain,(
0.21/0.54	  spl3_1 | spl3_2),
0.21/0.54	  inference(avatar_split_clause,[],[f46,f68,f64])).
0.21/0.54	thf(f82,definition,(
0.21/0.54	  spl3_5 <=> (((moref @ sF0 @ sF1)) = $false)),
0.21/0.54	  introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition])).
0.21/0.54	thf(f84,plain,(
0.21/0.54	  (((moref @ sF0 @ sF1)) = $false) | ~spl3_5),
0.21/0.54	  inference(avatar_component_clause,[],[f82])).
0.21/0.54	thf(f86,definition,(
0.21/0.54	  spl3_6 <=> (sF2 = $true)),
0.21/0.54	  introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition])).
0.21/0.54	thf(f89,plain,(
0.21/0.54	  spl3_5 | spl3_6),
0.21/0.54	  inference(avatar_split_clause,[],[f61,f86,f82])).
0.21/0.54	thf(f90,plain,(
0.21/0.54	  ~spl3_6),
0.21/0.54	  inference(avatar_split_clause,[],[f60,f86])).
0.21/0.54	thf(f103,plain,(
0.21/0.54	  ( ! [X0 : frac] : ((((moref @ sF0 @ (pf @ X0 @ z))) = $true) | (((moref @ x @ X0)) != $true)) )),
0.21/0.54	  inference(constrained_superposition,[],[f48,f56])).
0.21/0.54	thf(f140,plain,(
0.21/0.54	  ( ! [X0 : frac,X1 : frac] : (($false = $true) | (((eq @ X0 @ sF0)) != $true) | (((moref @ X0 @ X1)) != $true) | (((eq @ X1 @ sF1)) != $true)) ) | ~spl3_5),
0.21/0.54	  inference(constrained_superposition,[],[f43,f84])).
0.21/0.54	thf(f149,plain,(
0.21/0.54	  ( ! [X0 : frac,X1 : frac] : ((((eq @ X1 @ sF1)) != $true) | (((moref @ X0 @ X1)) != $true) | (((eq @ X0 @ sF0)) != $true)) ) | ~spl3_5),
0.21/0.54	  inference(trivial_inequality_removal,[],[f140])).
0.21/0.54	thf(f192,plain,(
0.21/0.54	  ( ! [X0 : frac,X1 : frac] : ((((moref @ (pf @ X0 @ X1) @ sF1)) = $true) | (((moref @ X1 @ u)) != $true) | (((moref @ X0 @ y)) != $true)) )),
0.21/0.54	  inference(constrained_superposition,[],[f44,f58])).
0.21/0.54	thf(f220,plain,(
0.21/0.54	  ( ! [X0 : frac,X1 : frac] : (($true = ((eq @ (pf @ X0 @ X1) @ sF1))) | (((eq @ X1 @ u)) != $true) | (((eq @ X0 @ y)) != $true)) )),
0.21/0.54	  inference(constrained_superposition,[],[f51,f58])).
0.21/0.54	thf(f287,plain,(
0.21/0.54	  (((moref @ sF0 @ sF1)) = $true) | (((moref @ x @ y)) != $true) | (((moref @ z @ u)) != $true)),
0.21/0.54	  inference(constrained_superposition,[],[f192,f56])).
0.21/0.54	thf(f289,plain,(
0.21/0.54	  (((moref @ z @ u)) != $true) | (((moref @ sF0 @ sF1)) = $true)),
0.21/0.54	  inference(forward_subsumption_resolution,[],[f287,f50])).
0.21/0.54	thf(f294,plain,(
0.21/0.54	  (((moref @ z @ u)) != $true) | ($false = $true) | ~spl3_5),
0.21/0.54	  inference(forward_demodulation,[],[f289,f84])).
0.21/0.54	thf(f295,plain,(
0.21/0.54	  (((moref @ z @ u)) != $true) | ~spl3_5),
0.21/0.54	  inference(trivial_inequality_removal,[],[f294])).
0.21/0.54	thf(f296,plain,(
0.21/0.54	  ~spl3_2 | ~spl3_5),
0.21/0.54	  inference(avatar_split_clause,[],[f295,f82,f68])).
0.21/0.54	thf(f382,plain,(
0.21/0.54	  ( ! [X2 : frac,X0 : frac,X1 : frac] : (($true != $true) | (((moref @ X2 @ (pf @ X0 @ X1))) != $true) | (((eq @ X0 @ y)) != $true) | (((eq @ X2 @ sF0)) != $true) | (((eq @ X1 @ u)) != $true)) ) | ~spl3_5),
0.21/0.54	  inference(constrained_superposition,[],[f149,f220])).
0.21/0.54	thf(f385,plain,(
0.21/0.54	  ( ! [X2 : frac,X0 : frac,X1 : frac] : ((((moref @ X2 @ (pf @ X0 @ X1))) != $true) | (((eq @ X1 @ u)) != $true) | (((eq @ X2 @ sF0)) != $true) | (((eq @ X0 @ y)) != $true)) ) | ~spl3_5),
0.21/0.54	  inference(trivial_inequality_removal,[],[f382])).
0.21/0.54	thf(f551,plain,(
0.21/0.54	  ( ! [X0 : frac] : ((((eq @ X0 @ y)) != $true) | (((eq @ z @ u)) != $true) | (((eq @ sF0 @ sF0)) != $true) | ($true != $true) | (((moref @ x @ X0)) != $true)) ) | ~spl3_5),
0.21/0.54	  inference(constrained_superposition,[],[f385,f103])).
0.21/0.54	thf(f556,plain,(
0.21/0.54	  ( ! [X0 : frac] : ((((eq @ z @ u)) != $true) | (((eq @ X0 @ y)) != $true) | (((eq @ sF0 @ sF0)) != $true) | (((moref @ x @ X0)) != $true)) ) | ~spl3_5),
0.21/0.54	  inference(trivial_inequality_removal,[],[f551])).
0.21/0.54	thf(f564,plain,(
0.21/0.54	  ( ! [X0 : frac] : ((((eq @ sF0 @ sF0)) != $true) | (((eq @ X0 @ y)) != $true) | (((moref @ x @ X0)) != $true)) ) | (~spl3_1 | ~spl3_5)),
0.21/0.54	  inference(forward_subsumption_resolution,[],[f556,f66])).
0.21/0.54	thf(f573,plain,(
0.21/0.54	  ( ! [X0 : frac] : ((((eq @ X0 @ y)) != $true) | (((moref @ x @ X0)) != $true)) ) | (~spl3_1 | ~spl3_5)),
0.21/0.54	  inference(forward_subsumption_resolution,[],[f564,f47])).
0.21/0.54	thf(f599,plain,(
0.21/0.54	  ($true != $true) | (((moref @ x @ y)) != $true) | (~spl3_1 | ~spl3_5)),
0.21/0.54	  inference(constrained_superposition,[],[f573,f47])).
0.21/0.54	thf(f602,plain,(
0.21/0.54	  (((moref @ x @ y)) != $true) | (~spl3_1 | ~spl3_5)),
0.21/0.54	  inference(trivial_inequality_removal,[],[f599])).
0.21/0.54	thf(f604,plain,(
0.21/0.54	  $false | (~spl3_1 | ~spl3_5)),
0.21/0.55	  inference(forward_subsumption_resolution,[],[f602,f50])).
0.21/0.55	thf(f605,plain,(
0.21/0.55	  ~spl3_1 | ~spl3_5),
0.21/0.55	  inference(avatar_contradiction_clause,[],[f604])).
0.21/0.55	cnf(s1, plain, spl3_1 | spl3_2, inference(sat_conversion,[],[f71])).
0.21/0.55	cnf(s3, plain, spl3_5 | spl3_6, inference(sat_conversion,[],[f89])).
0.21/0.55	cnf(s4, plain, ~spl3_6, inference(sat_conversion,[],[f90])).
0.21/0.55	cnf(s9, plain, ~spl3_2 | ~spl3_5, inference(sat_conversion,[],[f296])).
0.21/0.55	cnf(s21, plain, ~spl3_1 | ~spl3_5, inference(sat_conversion,[],[f605])).
0.21/0.55	cnf(s24, plain, spl3_5, inference(rat,[],[s3,s4])).
0.21/0.55	cnf(s25, plain, ~spl3_1, inference(rat,[],[s21,s24])).
0.21/0.55	cnf(s28, plain, ~spl3_2, inference(rat,[],[s9,s24])).
0.21/0.55	cnf(s29, plain, $false, inference(rat,[],[s1,s28,s25])).
0.21/0.55	thf(f606,plain,(
0.21/0.55	  $false),
0.21/0.55	  inference(avatar_sat_refutation,[],[s29])).
0.21/0.55	% SZS output end Proof for theBenchmark
0.21/0.55	% (943226)------------------------------
0.21/0.55	% (943226)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
0.21/0.55	% (943226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
0.21/0.55	% (943226)CaDiCaL version: 2.1.3
0.21/0.55	% (943226)Termination reason: Refutation
0.21/0.55	% (943226)Time elapsed: 0.022 s
0.21/0.55	% (943226)Peak memory usage: 13 MB
0.21/0.55	% (943226)Instructions burned: 40 (million)
0.21/0.55	% (943215)Success in time 0.062 s
0.21/0.55	% Vampire exiting
0.21/0.55	EOF